Some parameters of fuzzy labeling tree using matching and perfect matching

some properties of fuzzy hilbert spaces and norm of operators

in this thesis, at first we investigate the bounded inverse theorem on fuzzy normed linear spaces and study the set of all compact operators on these spaces. then we introduce the notions of fuzzy boundedness and investigate a new norm operators and the relationship between continuity and boundedness. and, we show that the space of all fuzzy bounded operators is complete. finally, we define...

Srikumar 1 Perfect Matching and Matching Polytopes

fault location in power distribution networks using matching algorithm

چکیده رساله/پایان نامه : تاکنون روش‏های متعددی در ارتباط با مکان یابی خطا در شبکه انتقال ارائه شده است. استفاده مستقیم از این روش‏ها در شبکه توزیع به دلایلی همچون وجود انشعاب‏های متعدد، غیر یکنواختی فیدرها (خطوط کابلی، خطوط هوایی، سطح مقطع متفاوت انشعاب ها و تنه اصلی فیدر)، نامتعادلی (عدم جابجا شدگی خطوط، بارهای تک‏فاز و سه فاز)، ثابت نبودن بار و اندازه گیری مقادیر ولتاژ و جریان فقط در ابتدای...

Perfect Matching Preservers

For two bipartite graphs G and G , a bijection ψ : E(G) → E(G) is called a (perfect) matching preserver provided that M is a perfect matching in G if and only if ψ(M) is a perfect matching in G. We characterize bipartite graphs G and G which are related by a matching preserver and the matching preservers between them.

Perfect Matching Disclosure Attacks

Traffic analysis is the best known approach to uncover relationships amongst users of anonymous communication systems, such as mix networks. Surprisingly, all previously published techniques require very specific user behavior to break the anonymity provided by mixes. At the same time, it is also well known that none of the considered user models reflects realistic behavior which casts some dou...